NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
361	Sets with Cardinality Constraints in Satisfiability Modulo Theories Philippe Suter? , Robin Steiger, and Viktor Kuncak ´ Ecole Polytechnique F´ed´erale de Lausanne (EPFL), Switzerland Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2010-11-10 10:57:45 Metalogic Formal methods Model theory Logic in computer science NP-complete problems First-order logic Satisfiability Modulo Theories Function Interpretation Logic Mathematics Theoretical computer science
362	Near-Optimal Algorithms for Maximum Constraint Satisfaction Problems Moses Charikar∗ Konstantin Makarychev∗† Add to Reading List Source URL: konstantin.makarychev.net Language: English - Date: 2014-06-08 22:16:07 Operations research NP-complete problems Linear programming Real algebraic geometry Semidefinite programming 2-satisfiability Mathematical optimization Constraint satisfaction problem Constraint satisfaction Theoretical computer science Applied mathematics Computational complexity theory
363	Dynamic Graphs in the Sliding-Window Model? Michael S. Crouch, Andrew McGregor, and Daniel Stubbs University of Massachusetts Amherst 140 Governors Drive, Amherst, MA 01003 {mcc,mcgregor,dstubbs}@cs.umass.edu Add to Reading List Source URL: people.cs.umass.edu Language: English - Date: 2013-06-23 17:01:11 Spanning tree Combinatorial optimization Matching Minimum spanning tree Graph NP-complete problems Graph theory Theoretical computer science Mathematics
364	Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs Philip N. Klein1 , Claire Mathieu2,3 , and Hang Zhou3 1 Brown University, United States Add to Reading List Source URL: www.normalesup.org Language: English - Date: 2015-03-16 13:08:36 NP-complete problems Cluster analysis Correlation clustering Graph Minor Planar graph Dominating set Independent set Matroid theory Graph theory Mathematics Theoretical computer science
365	Local Distributed Decision∗ Pierre Fraigniaud† Amos Korman† David Peleg‡ Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2011-10-30 17:16:12 NP-complete problems Network flow Operations research Probabilistic complexity theory Randomized algorithm Modular decomposition Dominating set Flow network XTR Theoretical computer science Mathematics Graph theory
366	Course Information Sheet Course: BMGT 831 (Network Optimization) Add to Reading List Source URL: www.amsc.umd.edu Language: English - Date: 2010-10-25 17:36:24 Operations research NP-complete problems Academia Mathematical optimization Combinatorial optimization Computational complexity theory Shortest path problem Academic dishonesty Travelling salesman problem Theoretical computer science Applied mathematics Mathematics
367	A Featured Exhibition on Display January 30, 2013 – April 27, Promenade Place Las Vegas, NV 89106 Add to Reading List Source URL: www.discoverykidslv.org Language: English - Date: 2014-01-24 15:23:44 Recreational mathematics Crossword Cluedo Sudoku Mindbender Games NP-complete problems Logic puzzles
368	Polylogarithmic Network Navigability Using Compact Metrics with Small Stretch Pierre Fraigniaud∗ Cyril Gavoille† Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2008-04-15 13:07:10 Graph operations Tree decomposition Connectivity NP-complete problems Network flow Graph theory Theoretical computer science Mathematics
369	Linear Arithmetic with Stars Ruzica Piskac and Viktor Kuncak School of Computer and Communication Sciences, EPFL, Switzerland Abstract. We consider an extension of integer linear arithmetic with a “star” operator tak Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2008-11-06 07:52:12 Linear algebra Boolean algebra Electronic design automation Formal methods NP-complete problems Multiset Boolean satisfiability problem Vector space Theorems and definitions in linear algebra Mathematics Algebra Theoretical computer science
370	Collections, Cardinalities, and Relations Kuat Yessenov1⋆ , Ruzica Piskac2 , and Viktor Kuncak2⋆⋆ 1 2 Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2009-11-10 09:06:44 Model theory Electronic design automation Logic in computer science NP-complete problems First-order logic Function Interpretation FO Boolean satisfiability problem Mathematics Logic Mathematical logic

UPDATE